Lazy Funtional State Threads: An Abstract
نویسندگان
چکیده
Some algorithms make critical internal use of updatable state , even though
منابع مشابه
Lazy Threads: Compiler and Runtime Structures for Fine-grained Parallel Programming Abstract Lazy Threads: Compiler and Runtime Structures for Fine-grained Parallel Programming
Lazy Threads Compiler and Runtime Structures for Fine Grained Parallel Programming by Seth Copen Goldstein Doctor of Philosophy in Computer Science University of California Berkeley Professor David E Culler Chair Many modern parallel languages support dynamic creation of threads or require multithreading in their implementations The threads describe the logical parallelism in the program For ea...
متن کاملBoosting Lazy Abstraction for SystemC with Partial Order Reduction
The SystemC language is a de-facto standard for the description of systems on chip. A recent approach to the formal verification of SystemC designs, called ESST, combines Explicit state techniques to deal with the SystemC Scheduler, with Symbolic techniques, based on lazy abstraction, to deal with the Threads. Despite its relative effectiveness, this approach suffers from the potential explosio...
متن کاملLazy-CSeq: A Lazy Sequentialization Tool for C - (Competition Contribution)
We describe a version of the lazy sequentialization schema by La Torre, Madhusudan, and Parlato that is optimized for bounded programs, and avoids the re-computation of the local state of each process at each context switch. Lazy-CSeq implements this sequentialization schema for sequentially consistent C programs using POSIX threads. Experiments show that it is very competitive.
متن کاملA functional correspondence between call-by-need evaluators and lazy abstract machines
We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations. This article is a spin-off of our article at PPDP 2003, where we consider call by name and call by value. Here, however, we consider call by need. We derive a lazy abstract machine fr...
متن کاملAn Abstract Machine for Curry and Its Concurrent Implementation in Java
Curry is a multi-paradigm declarative language aiming to amalgamate functional, logic, and concurrent programming paradigms. Curry combines in a seamless way features from functional programming and (concurrent) logic programming. Curry’s operational semantics is based on the combination of lazy reduction of expressions together with a possibly non-deterministic binding of free variables occurr...
متن کامل